Regular languages and partial commutations
نویسندگان
چکیده
منابع مشابه
Regular languages and partial commutations
The closure of a regular language under a [partial] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular? (2) Are there any robust classes of languages closed under [partial] commutation? We show that the class Pol(G) of polynomials of group languages is closed un...
متن کاملClosure of regular languages under semi-commutations
The closure of a regular language under a [partial, semi-] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial, semi-] commutation still regular? (2) Are there any robust classes of languages closed under [partial, semi-] commutation? We show that the class Pol(G) of polynomials of group l...
متن کاملContextual partial commutations
We consider the monoid T with the presentation 〈a, b; aab = aba〉 which is “close” to trace monoids. We prove two different types of results. First, we give a combinatorial description of the lexicographically minimum and maximum representatives of their congruence classes in the free monoid {a, b}∗ and solve the classical equations, such as commutation and conjugacy in T. Then we study the clos...
متن کاملRegular languages of partial words
We initiate a study of languages of partial words related to regular languages of full words. First, we investigate the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words by a finite set of letters. Results regarding the structure, uniqueness and succinctness of such ...
متن کاملConnecting Partial Words and Regular Languages
We initiate a study of languages of partial words related to regular languages of full words. First, we study the possibility of expressing a regular language of full words as the image of a partial-wordslanguage through a substitution that only replaces the hole symbols of the partial words with a finite set of letters. Results regarding the structure, uniqueness and succinctness of such a rep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.07.003